Necklace Swap Problem for Rhythmic Similarity Measures

نویسندگان

  • Yoan J. Pinzón
  • Raphaël Clifford
  • Manal Mohamed
چکیده

Given two n-bit (cyclic) binary strings, A and B, represented on a circle (necklace instances). Let each sequence have the same number k of 1’s. We are interested in computing the cyclic swap distance between A and B, i.e., the minimum number of swaps needed to convert A to B, minimized over all rotations of B. We show that, given the compressed representation of A and B, this distance may be computed in O(k2).

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Measuring Similarity between Flamenco Rhythmic Patterns

Music similarity underlies a large part of a listener’s experience, as it relates to familiarity and associations between different pieces or parts. Rhythmic similarity has received scant research attention in comparison with other aspects of music similarity such as melody or harmony. Mathematical measures of rhythmic similarity have been proposed, but none of them has been compared to human j...

متن کامل

Target-Based Rhythmic Pattern Generation and Variation with Genetic Algorithms

Composing drum patterns and musically developing them through repetition and variation is a typical task in electronic music production. We propose a system that, given an input pattern, automatically creates related patterns using a genetic algorithm. Two distance measures (the Hamming distance and directed-swap distance) that relate to rhythmic similarity are shown to derive usable fitness fu...

متن کامل

Approximation algorithm for the cyclic swap problem

Given two n-bit (cyclic) binary strings, A and B, represented on a circle (necklace instances). Let each sequence have the same number k of 1’s. We are interested in computing the cyclic swap distance between A and B, i.e., the minimum number of swaps needed to convert A into B, minimized over all rotations of B. We show that this distance may be approximated in O(n + k2) time.

متن کامل

A Comparison of Rhythmic Dissimilarity Measures

Measuring the dissimilarity between musical rhythms is a fundamental problem with many applications ranging from music information retrieval and copyright infringement resolution to computational music theory and evolutionary studies of music. A common way to represent a rhythm is as a binary sequence where a zero denotes a rest (silence) and a one represents a beat or note onset. This paper fi...

متن کامل

INFORMATION MEASURES BASED TOPSIS METHOD FOR MULTICRITERIA DECISION MAKING PROBLEM IN INTUITIONISTIC FUZZY ENVIRONMENT

In the fuzzy set theory, information  measures play a paramount role in several areas such as decision making, pattern recognition etc. In this paper, similarity measure based on cosine function and entropy measures based on logarithmic function for IFSs are proposed. Comparisons of proposed similarity and entropy measures with the existing ones are listed. Numerical results limpidly betoken th...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005